Vanishing Configurations in Network Dynamics with Asynchronous Updates
نویسنده
چکیده
We consider Boolean dynamics for biological networks where stochasticity is introduced through asynchronous updates. An exact method is given for finding states which can reach a steady state with positive probability, and a method is given for finding states which cannot reach other steady states. The methods are based on computational commutative algebra. The algorithms are applied to dynamics of a cell survival network to determine node assignments that exclude termination in a cancerous state.
منابع مشابه
DALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs
Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...
متن کاملAsynchronous Simulation of Boolean Networks by Monotone Boolean Networks
We prove that the fully asynchronous dynamics of a Boolean network f : {0, 1} → {0, 1} without negative loop can be simulated, in a very specific way, by a monotone Boolean network with 2n components. We then use this result to prove that, for every even n, there exists a monotone Boolean network f : {0, 1} → {0, 1}, an initial configuration x and a fixed point y of f such that: (i) y can be re...
متن کاملPropagation of external regulation and asynchronous dynamics in random Boolean networks.
Boolean networks and their dynamics are of great interest as abstract modeling schemes in various disciplines, ranging from biology to computer science. Whereas parallel update schemes have been studied extensively in past years, the level of understanding of asynchronous updates schemes is still very poor. In this paper we study the propagation of external information given by regulatory input...
متن کاملFixed-points in random Boolean networks: The impact of parallelism in the Barabási-Albert scale-free topology case
Fixed points are fundamental states in any dynamical system. In the case of gene regulatory networks (GRNs) they correspond to stable genes profiles associated to the various cell types. We use Kauffman's approach to model GRNs with random Boolean networks (RBNs). In this paper we explore how the topology affects the distribution of the number of fixed points in randomly generated networks. We ...
متن کاملOn the Analysis of "Simple" 2D Stochastic Cellular Automata
We analyze the dynamics of a two-dimensional cellular automaton, 2D Minority, for the Moore neighborhood (eight neighbors per cell) under fully asynchronous dynamics (where only one random cell updates at each time step). Even if 2D Minority seems a simple rule, from the experience of Ising models and Hopfield nets, it is known that models with negative feedback are hard to study. This automato...
متن کامل